Incompleteness of semantics for intermediate predicate logics, I. Kripke's Semantics

نویسندگان

چکیده

برای دانلود باید عضویت طلایی داشته باشید

برای دانلود متن کامل این مقاله و بیش از 32 میلیون مقاله دیگر ابتدا ثبت نام کنید

اگر عضو سایت هستید لطفا وارد حساب کاربری خود شوید

منابع مشابه

On Reduced Semantics for Fuzzy Predicate Logics

Our work is a contribution to the model-theoretic study of equality-free fuzzy predicate logics. We present a reduced semantics and we prove a completeness theorem of the logics with respect to this semantics. The main concepts being studied are the Leibniz congruence and the relative relation. On the one hand, the Leibniz congruence of a model identifies the elements that are indistinguishable...

متن کامل

Decidability of Predicate Logics with Team Semantics

We study the complexity of predicate logics based on team semantics. We show that the satisfiability problems of two-variable independence logic and inclusion logic are both NEXPTIMEcomplete. Furthermore, we show that the validity problem of two-variable dependence logic is undecidable, thereby solving an open problem from the team semantics literature. We also briefly analyse the complexity of...

متن کامل

Inquisitive Semantics and Intermediate Logics

Contents 1 An introduction to inquisitive semantics 1 1.1 Information states and the classical update perspective .

متن کامل

Non-Monotonic Predicate Logics Syntax, Semantics, Completeness

To simplify our account, rewrite your favorite usual predicate logic, classical, modal, intuitionistic, as a logic of the set L of all statements. This is an inessential change. As Tarski once did, arrange it so that only statements occur in all axioms a and rules of inference I, all of which have the (monotonic) form ”from a, a, ..., infer a. Then a deductively closed set D is merely a subset ...

متن کامل

Predicate Introduction for Logics with a Fixpoint Semantics. Part I: Logic Programming

We study the transformation of “predicate introduction” in non-monotonic logics. By this, we mean the act of replacing a complex formula by a newly defined predicate. From a knowledge representation perspective, such transformations can be used to eliminate redundancy or to simplify a theory. From a more practical point of view, they can also be used to transform a theory into a normal form imp...

متن کامل

ذخیره در منابع من


  با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید

ژورنال

عنوان ژورنال: Proceedings of the Japan Academy, Series A, Mathematical Sciences

سال: 1973

ISSN: 0386-2194

DOI: 10.3792/pja/1195519184